Tableaux and Algorithms for Propositional Dynamic Logic with Converse
نویسندگان
چکیده
This paper presents a pre xed tableaux calculus for Proposi tional Dynamic Logic with Converse based on a combination of di erent techniques such as pre xed tableaux for modal logics and model checkers for mu calculus We prove the correctness and completeness of the calcu lus and illustrate its features We also discuss the transformation of the tableaux method naively NEXPTIME into an EXPTIME algorithm
منابع مشابه
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of different techniques such as prefixed tableaux for modal logics and model checkers for +-calculus. We prove the correctness and completeness of the calculus and illustrate its features. We also discuss the transformation of the tableaux method (naively NEXPTIME) into an EXPTI...
متن کاملOptimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse
We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic with converse (CPDL) which does not require the use of analytic cut. Our main contribution is a sound method to combine our previous optimal method for tracking least fix-points in PDL with our previous optimal method for handling converse in the description logic ...
متن کاملFlat modal fixpoint logics with the converse modality
We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Venema. We observe that Santocanale and Venema’s proof that least fixpoints in the Lindenbaum-Tarski algebra of certain flat fixpoint logics are constructive, using finitary adjoints, no longer works when the converse m...
متن کاملTableaux for Dynamic Logic of Propositional Assignments
The Dynamic Logic for Propositional Assignments (DL-PA) has recently been studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the abstract atomic programs of PDL are replaced by assignments of propositional variables to truth values. This makes DL-PA enjoy some interesting meta-logical properties that PDL does not, such as eliminability of the Kleene star, compactness and ...
متن کاملA New Mapping from ALCI to ALC
It is well known that a correspondence theory for description logics (DLs), propositional modal logics (MLs) and propositional dynamic logics (PDLs) was given in [Sch91] and that an axiomatic system for a description logic with inverse roles was presented in the same paper. Schild’s paper covers what is to be discussed in this paper although his paper did not mention nominals as well as express...
متن کامل